Factoring Boolean functions using graph partitioning

Factoring Boolean functions using graph partitioning

Factoring Boolean functions is one of the basic operations in algorithmic logic synthesis. Current algorithms for factoring Boolean functions are based on some kind of division (Boolean or algebraic). In this paper, we present an algorithm for factoring that uses graph partitioning rather than division. Our algorithm is recursive and operates on the function and on its dual, to obtain the bette...

Partitioning 1-variable Boolean functions for various classification of n-variable Boolean functions

Partitioning 1-variable Boolean functions for various classification of nvariable Boolean functions Ranjeet Kumar Rout, Pabitra Pal Choudhury, Sudhakar Sahoo & Camellia Ray a Applied Statistics Unit, Indian Statistical Institute, Kolkata-700108, India; b Institute of Mathematics and Applications, Bhubaneswar-751003, India Accepted author version posted online: 14 Oct 2014.Published online: 14 N...

Partitioning the Intrinsic Order Graph for Complex Stochastic Boolean Systems

Many different problems in Engineering and Computer Science can be modeled by a complex system depending on a certain number n of stochastic Boolean variables: the so-called complex stochastic Boolean system (CSBS). The most useful graphical representation of a CSBS is the intrinsic order graph (IOG). This is a symmetric, self-dual diagram on 2 nodes (denoted by In) that displays all the binary...

Factoring logic functions using star-colorings

Graph Partitioning Using Learning Automata

Given a graph G, we intend to partition its nodes into two sets of equal size so as to minimize the sum of the cost of the edges having end-points in different sets. This problem, called the uniform Graph Partitioning Problem (GPP), is known to be NP-Complete. In this paper we propose the first reported learning-automaton based solution to the problem. We compare this new solution to various re...